A Scheduling Heuristic for Job Shop Manufacturing System
نویسندگان
چکیده
In the past, many production-scheduling methods were developed to achieve high due-date and short manufacturing lead times performance. Among them, DRUMBUFFER-ROPE (DBR) has been recognized as one of the excellent solutions. However, there are some implementation constraints (e.g., time buffer determination, setup ratio evaluation, non-CCR subordination etc.) limit its implementation performance. To overcome these limits and enhance the DBR implementation, we present a novel scheduling heuristic algorithm for job shop manufacturing system based on Capacity Constraint Resource (CCR). The proposed algorithm consists of four stages: (1) schedule development for CCR (DRUM), (2) CCR setup time savings to decrease mean tardiness, (3) CCR setup time savings to maximize CCR throughput, and (4) development of a hybrid scheduling method to minimize total flowtime and the work-inprocess (WIP) inventory. Also, an illustrative example demonstrates the feasibility of the proposed method.
منابع مشابه
A Hierarchical Production Planning and Finite Scheduling Framework for Part Families in Flexible Job-shop (with a case study)
Tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. Production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. Hence, integration has been proposed to decide about these problems concurrently. Main problem in integration is how we can relate pro...
متن کاملA multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملFlow shop scheduling with multiple operations and time lags
A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...
متن کاملEconomically Coordinated Job Shop Scheduling and Decision Point Bidding - An Example for Economic Coordination in Manufacturing and Logistics
We discuss the application of economic coordination mechanisms to scheduling problems in manufacturing and logistics. We use job shop scheduling as a sample problem domain. We study economically augmented job shop problems (EJSP) which comprise valuation information. We demonstrate how instances of EJSP can be mapped to combinatorial job shop auction problems (CJSAP). A discussion of the tracta...
متن کاملAn Improved Tabu Search Approach for Solving the Job Shop Scheduling Problem with Tooling Constraints
Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, i...
متن کاملNeuro-Genetic Order Acceptance in a Job Shop setting
In this paper a new neuro-genetic architecture is presented that solves a profit oriented dynamic job shop problem. In the job shop order acceptance and scheduling problem new jobs arrive continuously and because of insufficient job shop capacity, a selection has to be made among the offered jobs. The goal is to find an order acceptance policy, which is supported by a scheduling policy, that ma...
متن کامل